Ambiguity of Ï-Languages of Turing Machines
نویسندگان
چکیده
منابع مشابه
Ambiguity of omega-Languages of Turing Machines
An ω-language is a set of infinite words over a finite alphabet X. We consider the class of recursive ω-languages, i.e. the class of ω-languages accepted by Turing machines with a Büchi acceptance condition, which is also the class Σ1 of (effective) analytic subsets of X for some finite alphabet X. We investigate here the notion of ambiguity for recursive ω-languages with regard to acceptance b...
متن کاملAmbiguity of ω-Languages of Turing Machines
An ω-language is a set of infinite words over a finite alphabet X . We consider the class of recursive ω-languages, i.e. the class of ω-languages accepted by Turing machines with a Büchi acceptance condition, which is also the class Σ 1 of (effective) analytic subsets of Xω for some finite alphabet X . We investigate the notion of ambiguity for recursive ωlanguages with regard to acceptance by ...
متن کاملAlternating Turing machines for inductive languages
We show that alternating Turing machines, with a novel and natural definition of acceptance, accept precisely the inductive (Π11) languages. Total alternating machines, that either accept or reject each input, accept precisely the hyper-elementary (∆11) languages. Moreover, bounding the permissible number of alternations yields a characterization of the levels of the arithmetical hierarchy. Not...
متن کاملAcceptance of -Languages by Communicating Deterministic Turing Machines
Using a specific model of communicating deterministic Turing machines we prove that the class of -languages accepted by deterministic Turing machines via complete non-oscillating (complete oscillating) runs on the input coincides with the class of -definable ( -definable, respectively) -languages. email: [email protected] email: [email protected] 2 R. Freund and L. Staiger
متن کاملSome improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2014
ISSN: 1860-5974
DOI: 10.2168/lmcs-10(3:12)2014